Marking Estimation in Labelled Petri nets by the Representative Marking Graph

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Marking Estimation of Petri Nets with Λ-free Labeling

We present a technique for estimating the marking of a Petri net based on the observation of transition labels. In particular, the main contribution of the paper consists in deriving a methodology that can handle the case of nondeterministic transitions, i.e., transitions that share the same label. Under some technical assumptions, the set of markings consistent with an observation can be repre...

متن کامل

Marking estimation of Petri nets with pairs of nondeterministic transitions∗

We present a technique for estimating the marking of a Petri net based on the observation of transition labels. In particular, the main contribution of the paper consists in deriving a methodology that can handle the case of nondeterministic transitions, i.e., transitions that share the same label. Under some technical assumptions, the set of markings consistent with an observation can be repre...

متن کامل

Marking Estimation of Petri Nets with Arbitrary Transition Labeling

In this paper we deal with the problem of estimating the marking of an arbitrary labeled Petri net system where two forms of nondeterminism may occur. Firstly, there may exist unobservable transitions, i.e., transitions labeled with the empty string. Secondly, there may exist undistinguishable transitions, i.e., two or more transitions sharing the same symbol taken from a given alphabet E may s...

متن کامل

Marking Estimation of Petri Nets based on Partial Observation

We present a technique for estimating the marking of a Petri net based on the observation of transition labels. In particular, the main contribution of the paper consists in deriving a methodology that can handle the case of nondeterministic transitions, i.e., transitions that share the same label. Under some technical assumptions, the set of markings consistent with an observation can be repre...

متن کامل

New Canonical Representative Marking Algorithms for Place/Transition-Nets

Symmetries of a Place/Transition-net can be exploited during the reachability analysis by considering only one representative marking in each orbit induced by the symmetries. In this report, three new algorithms for transforming a marking into a symmetric canonical representative marking are described. All the algorithms depend on the precalculation of a SchreierSims representation for the symm...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IFAC-PapersOnLine

سال: 2017

ISSN: 2405-8963

DOI: 10.1016/j.ifacol.2017.08.1240